Fault-tolerant embedding of paths in crossed cubes

نویسندگان

  • Meijie Ma
  • Guizhen Liu
  • Jun-Ming Xu
چکیده

The crossed cube CQn is an important variant of the hypercube Qn and possesses many desirable properties for interconnection networks. This paper shows that in CQn with fv faulty vertices and fe faulty edges there exists a fault-free path of length ` between any two distinct fault-free vertices for each ` satisfying 2n−1 − 1 ≤ ` ≤ 2n − fv − 1 provided that fv + fe ≤ n − 3, where the lower bound of ` and the upper bound of fv + fe are tight for some n. Moreover, this result improves the known result that CQn is (n − 3)-Hamiltonian connected. © 2008 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonian Connectivity of Twisted Hypercube-Like Networks under the Large Fault Model

Twisted hypercube-like networks (THLNs) are an important class of interconnection networks for parallel computing systems, which include most popular variants of the hypercubes, such as crossed cubes, Möbius cubes, twisted cubes and locally twisted cubes. This paper deals with the fault-tolerant hamiltonian connectivity of THLNs under the large fault model. Let G be an n-dimensional THLN and F ...

متن کامل

Fault-Tolerant Cycle Embedding in Restricted Hypercube-like Networks with More Faulty Nodes

The hypercube-like networks are a class of important generalization of the popular hypercube interconnection networks for parallel computing. This paper is concerned with the fault-tolerant cycle embedding ability of a subclass of hypercube-like networks, called restricted hypercube-like networks (RHLNs, for short), which include most of the well-known hypercube variants, such as the twisted cu...

متن کامل

Optimal fault-tolerant embedding of paths in twisted cubes

The twisted cube is an important variation of the hypercube. It possesses many desirable properties for interconnection networks. In this paper, we study fault-tolerant embedding of paths in twisted cubes. Let TQn(V,E) denote the n-dimensional twisted cube. We prove that a path of length l can be embedded between any two distinct nodes with dilation 1 for any faulty set F ⊂ V (TQn)∪E(TQn) with ...

متن کامل

Fault-tolerant cycle-embedding of crossed cubes

The crossed cube CQn introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQn is about one half of that of the hypercube. Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault-tolerant capability of the crossed cube. Letting fe and fv be the numbers of faulty edges and ver...

متن کامل

Edge Congestion and Topological Properties of Crossed Cubes

An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path routing algorithm, we consider a new perfo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 407  شماره 

صفحات  -

تاریخ انتشار 2008